The Gonality Sequence of Complete Graphs
نویسندگان
چکیده
منابع مشابه
The Gonality Sequence of Complete Graphs
The gonality sequence (γr)r>1 of a finite graph/metric graph/algebraic curve comprises the minimal degrees γr of linear systems of rank r. For the complete graph Kd, we show that γr = kd − h if r < g = (d−1)(d−2) 2 , where k and h are the uniquely determined integers such that r = k(k+3) 2 − h with 1 6 k 6 d − 3 and 0 6 h 6 k. This shows that the graph Kd has the gonality sequence of a smooth p...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملExpander Graphs, Gonality and Variation of Galois Representations
We show that families of coverings of an algebraic curve where the associated Cayley-Schreier graphs form an expander family exhibit strong forms of geometric growth. Combining this general result with finiteness statements for rational points under such conditions, we derive results concerning the variation of Galois representations in oneparameter families of abelian varieties.
متن کاملThe automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6876